#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
#define endl '\n'
const int N = 1010;
int a[N];
void solve() 
{
    int n; cin >> n;
    int s = 0;
    for(int i = 1; i <= n; i++)
    {
       cin >> a[i];
    }
    sort(a + 1, a + 1 + n);
    for(int i = 1; i <= n; i++)
       if((n - i + 1) % 2) 
            s ^= (a[i] - a[i - 1] - 1); 
    if(s) cout << "Georgia will win" << endl;
    else cout << "Bob will win" << endl;
}

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T;
	cin >> T;
	while(T--)
	{
        solve();
	}
	return 0;
}